Representing Directed Trees as Straight Skeletons
نویسندگان
چکیده
The straight skeleton of a polygon is the geometric graph obtained by tracing the vertices during a mitered offsetting process. It is known that the straight skeleton of a simple polygon is a tree, and one can naturally derive directions on the edges of the tree from the propagation of the shrinking process. In this paper, we ask the reverse question: Given a tree with directed edges, can it be the straight skeleton of a polygon? And if so, can we find a suitable simple polygon? We answer these questions for all directed trees where the order of edges around each node is fixed.
منابع مشابه
Parallel skeletons for manipulating general trees
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficient parallel programs manipulating trees, because of their irregular and ill-balanced structures. In this paper, we propose a solution based on the skeletal approach. We formalize a set of skeletons (abstracted computati...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Design and Implementation of General Tree Skeletons
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficient parallel programs manipulating trees of arbitrary shapes, because of their irregular and ill-balanced structures. In this paper, we propose a solution for them based on the skeletal approach, in particular for genera...
متن کاملStraight skeletons with additive and multiplicative weights and their application to the algorithmic generation of roofs and terrains
We introduce additively-weighted straight skeletons as a new generalization of straight skeletons. An additively-weighted straight skeleton is the result of a wavefront-propagation process where, unlike in previous variants of straight skeletons, wavefront edges do not necessarily start to move at the begin of the propagation process but at later points in time. We analyze the properties of add...
متن کاملParallel Programming with Tree Skeletons
Parallel computing is an essential technique to deal with large scaled problems. In recent years, while hardware for parallel computing is getting widely available, developing software for parallel computing remains as a hard task for many programmers. The main difficulties are caused by the communication, synchronization, and data distribution required in parallel programs. This thesis studies...
متن کاملTitle: Computing Mitered Offset Curves Based on Straight Skeletons
Introduction: The straight skeleton of a polygon in 2D was first defined by Aichholzer et al. [2]. It is the geometric graph whose edges are the traces of vertices of shrinking mitered offset curves of the polygon, see Figure 1, left. Straight skeletons are a versatile tool in computational geometry and have found applications in diverse fields of industry and science. E.g., Tomoeda et al. use ...
متن کامل